Optimized Colored Nets Unfolding
نویسندگان
چکیده
As some structural properties, like generative families of positive P-invariants, can only be computed in P/T nets, unfolding of Colored Petri Nets is of interest. However, it may generate huge nets that cannot be stored concretely in memory. In some cases, removing the dead parts of the unfolded net can dramatically reduce its size, but this operation requires the unfolded net to be represented anyway. This paper presents a symbolic representation of unfolded nets using Data Decision Diagrams. This technique allows to store very large models and manipulate them for optimization purpose.
منابع مشابه
Factorization Properties of Symbolic Unfoldings of Colored Petri Nets
The unfolding technique is an efficient tool to explore the runs of a Petri net in a true concurrency semantics, i.e. without constructing all the interleavings of concurrent actions. But even small real systems are never modeled directly as ordinary Petri nets: they use many high-level features that were designed as extensions of Petri nets. We focus here on two such features: colors and compo...
متن کاملAccessibility Evaluation in Biometric Hybrid Architecture for Protecting Social Networks Using Colored Petri Nets
In the last few decades, technological progress has been made important information systems that require high security, Use safe and efficient methods for protecting their privacy. It is a major challenge to Protecting vital data and the ability to threaten attackers. And this has made it important and necessary to be sensitive to the authentication and identify of individuals in confidential n...
متن کاملOn the Computation of Stubborn Sets of Colored Petri Nets
Valmari’s Stubborn Sets method is a member of the so-called partial order methods. These techniques are usually based on a selective search algorithm: at each state processed during the search, a stubborn set is calculated and only the enabled transitions of this set are used to generate the successors of the state. The computation of stubborn sets requires to detect dependencies between transi...
متن کاملCatalog-based Token Transportation in Acyclic Block-Structured WF-nets
The problem of workflow instance migration occurs during dynamic evolutionary changes in processes. The paper presents a catalogbased algorithm called the Yo-Yo Algorithm for consistent instance migration in Petri net workflow models. It uses a technique of folding and unfolding of nets. The algorithm is formulated in terms of Colored Derivation Trees, a novel representation of the runtime stat...
متن کاملAccessibility Evaluation in Biometric Hybrid Architecture for Protecting Social Networks Using Colored Petri Nets
In the last few decades, technological progress has been made important information systems that require high security, Use safe and efficient methods for protecting their privacy. It is a major challenge to Protecting vital data and the ability to threaten attackers. And this has made it important and necessary to be sensitive to the authentication and identify of individuals in confidential n...
متن کامل